Fast FPGA algorithm for neutron–gamma discrimination

نویسندگان

چکیده

Various pulse shape discrimination methods have been used to solve the neutron-gamma problem. But most of them are limited off-line calculation due computation amount and FPGA performance. In order realize real time discriminating neutron gamma, a new algorithm based on traditional was proposed in this paper. The takes into account physical properties signal, which greatly reduces dead without losing precision, can work directly. It has good performance actual experiment CLLB scintillation detector.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of Fast Fourier Transform Algorithm in FPGA

This paper shows a design and implementation of a radix-4 FFT in FPGA using a Xilinx Spartan-6. The decimation in time equations are reviewed and in sequence several FPGA modules are presented according to algorithm architecture looking for optimization in execution time and occupied device area. Several tests were performed in order to validate the algorithm performance, FFT functionality, and...

متن کامل

Fast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets

Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...

متن کامل

Placement Algorithm for FPGA Circuits

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

متن کامل

Genetic Algorithm for FPGA Placement

Field-Programmable Gate Arrays (FPGAs) are flexible circuits that can be (re)configured by the designer. The efficient use of these circuits requires complex CAD tools. One of the steps of the design process for FPGAs is represented by placement. In this paper we present a genetic algorithm for the FPGA placement problem, in particular for the Atmel FPGA circuits. Because of the limited routing...

متن کامل

FPGA Implementation for Fast Infrared Spots Detection

This paper introduces a fast infrared spots detection algorithm designed for field-programmable gate array (FPGA) implementation. The proposed algorithm processes four pixels per clock cycle and detects infrared spots in a single pass over a frame. The implementation of the algorithm is only composed of combinatorial logic and registers. Furthermore, the execution time of the algorithm is indep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Instruments and Methods in Physics Research

سال: 2022

ISSN: ['1872-9576', '0168-9002']

DOI: https://doi.org/10.1016/j.nima.2021.166256